Erratum: Garbled messages and corrupted translations

Belief propagation vs. TAP for decoding corrupted messages

– We employ two different methods, based on belief propagation and TAP, for decoding corrupted messages encoded by employing Sourlas’s method, where the code word comprises products of K bits selected randomly from the original message. We show that the equations obtained by the two approaches are similar and provide the same solution as the one obtained by the replica approach in some cases (K...

Garbled Elections

Majority rules are frequently used to decide whether or not a public good should be provided, but will typically fail to achieve an efficient provision. We provide a worst-case analysis of the majority rule with an optimally chosen majority threshold, assuming that voters have independent private valuations and are ex-ante symmetric (provision cost shares are included in the valuations). We sho...

Erratum

Garbled Quantum Computation

The universal blind quantum computation protocol (UBQC) enables an almost classical client to delegate a quantum computation to an untrusted quantum server (in the form of a garbled quantum circuit) while the security for the client is unconditional. In this contribution, we explore the possibility of extending the verifiable UBQC, to achieve further functionalities following the analogous rese...

Amortizing Garbled Circuits

We consider secure two-party computation in a multiple-execution setting, where two parties wish to securely evaluate the same circuit multiple times. We design efficient garbled-circuitbased two-party protocols secure against malicious adversaries. Recent works by Lindell (Crypto 2013) and Huang-Katz-Evans (Crypto 2013) have obtained optimal complexity for cut-andchoose performed over garbled ...